Quantum logics and convex geometry

Convex and Discrete Geometry

Geir Agnarsson, Jill Bigley Dunham.* George Mason University, Fairfax, VA. Extremal coin graphs in the Euclidean plane. A coin graph is a simple geometric intersection graph where the vertices are represented by non-overlapping closed disks in the Euclidean plane and where two vertices are connected if their corresponding disks touch. The problem of determining the maximum number of edges of a ...

Convex Geometry and Stoichiometry

We demonstrate the benefits of a convex geometric perspective for questions on chemical stoichiometry. We show that the balancing of chemical equations, the use of “mixtures” to explain multiple stoichiometry, and the half-reaction for balancing redox actions all yield nice convex geometric interpretations. We also relate some natural questions on reaction mechanisms with the enumeration of lat...

quantum models and logics

Convex and Combinatorial Geometry Fest

Karoly Bezdek and Egon Schulte are two geometers who have made important and numerous contributions to Discrete Geometry. Both have trained many young mathematicians and have actively encouraged the development of the area by professors of various countries. Karoly Bezdek studied the illumination problem among many other problems about packing and covering of convex bodies. More recently he has...

Scalable Frames and Convex Geometry

The recently introduced and characterized scalable frames can be considered as those frames which allow for perfect preconditioning in the sense that the frame vectors can be rescaled to yield a tight frame. In this paper we define m-scalability, a refinement of scalability based on the number of nonzero weights used in the rescaling process, and study the connection between this notion and ele...